Fast and Efficient Computation of MDCT/IMDCT Algorithms for MP3 Applications
نویسندگان
چکیده
The modified discrete cosine transforms (MDCT) and its inverse (IMDCT) has become important for audio codec. MDCT/IMDCT algorithms are widely applied to realize the analysis/synthesis filter banks of the time-domain aliasing cancellation scheme for sub band coding in various audio standards. The inverse modified discrete cosine transform (IMDCT) is the most computational intensive operations in the MPEG audio decoding standard. Efficient algorithms for realizing the IMDCT become very important in decoding process. This paper presents a novel and efficient algorithm for computation of Inverse modified Discrete Cosine Transform (IMDCT) with block size N=12 and 36 points is proposed based on type IV DCT and type II DCT, which improves the efficiency of computation. Firstly IMDCT with block size N is converted into type IV DCT, which is further transformed into DCT II with block size N/4. Comparison of the computational complexity with some known algorithms shows that the proposed new approach reduces the number of arithmetic operations significantly such as number Multiplications and Additions.
منابع مشابه
Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding
The modified discrete cosine transform (MDCT) is always employed in transform-coding schemes as the analysis/ synthesis filter bank. In this paper, an efficient algorithm for MDCT and inverse MDCT (IMDCT) computation for MPEG-1 audio layer III and MPEG-2 international audio-coding standards is proposed, using only the type-II DCT. Finally, the proposed algorithm is compared to the similar algor...
متن کاملMixed-radix Algorithm for the Computation of Forward and Inverse MDCT
The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computational intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficient computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation in frequency (DIF) algorit...
متن کاملA fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size M×N into four 2-D discrete cosine transforms (DCTs) with block size (M/4)×(N/4). It is based on an algorithm recently presented by Cho [7] for the efficient calculation of one-dimensional MDCT ...
متن کاملFast IMDCT and MDCT algorithms - a matrix approach
This paper presents a systematic investigation of the modified discrete cosine transform/inverse modified discrete cosine transform (MDCT/IMDCT) algorithm using a matrix representation. This approach results in new understanding of the MDCT/IMDCT, enables the development of new algorithms, and makes clear the connection between the algorithms. We represent in a matrix form the IMDCT as the prod...
متن کاملComputation of forward and inverse MDCT using Clenshaw's recurrence formula
The forward and inverse modified discrete cosine transform (MDCT) are two of the most computational intensive operations in the MPEG audio coding standard. In this paper, we used Clenshaw’s recurrence formula to transform kernels of the MDCT and IMDCT of the general length. Efficient implementations of MDCT and IMDCT are obtained. The proposed regular structures are particularly suitable for pa...
متن کامل